On the Spread of Random Interleaver

نویسندگان

  • Arya Mazumdar
  • Adrish Banerjee
  • Ajit Kumar Chaturvedi
چکیده

For a given blocklength we determine the number of interleavers which have spread equal to two. Using this, we find out the probability that a randomly chosen interleaver has spread two. We show that as blocklength increases, this probability increases but very quickly converges to the value 1 − e −2 ≈ 0.8647. Subsequently, we determine a lower bound on the probability of an interleaver having spread at least s. We show that this lower bound converges to the value e 2 , as the blocklength increases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-Random Interleaver Design Criteria

Christine Fragouli and Ri hard D. Wesel Ele tri al Engineering Department University of California, Los Angeles hristin ee.u la.edu, wesel ee.u la.edu Abstra t A spread interleaver [1℄ of length N is a semi-random interleaver based on the random sele tion without repla ement of N integers from 1 to N under a design onstraint. This paper extends the spread-interleaver design method to multiple e...

متن کامل

A New Deterministic Interleaver for Turbo Codes

Interleavers play a critical role in performance of turbo codes. The turbo code performance curve can change its slope in low bit error rate (BER) region, if the interleaver is not designed properly. The interleaver is also a cause of bottleneck for parallelization of turbo decoder. In this paper, we propose the design of interleaver that combines the regular permutation of the interleaver and ...

متن کامل

On the Design and Performance of high throughput parallel block and random interleavers for Turbo Codes

It is known that one of the essential building blocks of turbo codes is the interleaver and its design using random, semi-random (S-Random) and deterministic permutations. In this paper, two new types of turbo code interleavers, Enhanced Block S-Random (EBSR) interleaver is proposed. The design algorithm for the new interleaver is described in depth, and the simulation results are compared to t...

متن کامل

Design of two step deterministic interleaver for turbo codes

The performance and design of a deterministic interleaver for short frame turbo codes is considered in this paper. The main characteristic of this class of deterministic interleaver is that their algebraic design selects the best permutation generator such that the points in smaller subsets of the interleaved output are uniformly spread over the entire range of the information data frame. It is...

متن کامل

Interleaver Design for Turbo Codes with Identical and Non-Identical Constituent Codes

The interleaver plays a key role in determining the turbo code error performance. The proper interleaver design should increase the minimum Hamming distance of the code and decrease the number of codewords with low Hamming weight. When a pseudo-random interleaver is used, the class of low-weight self-terminating (ST) input sequences is most likely to produce low-weight codewords. This paper dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0510067  شماره 

صفحات  -

تاریخ انتشار 2005